#include <bits/stdc++.h>
#define fr first
#define sc second
#define mp make_pair

using namespace std;

typedef pair<int, int> pii;
const int MAXN = 1e5 + 10;
int r[MAXN];
int n, ans;
queue<pii> q;

int main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> r[i];
    ans = n;
    sort(r + 1, r + 1 + n);
    for (int i = 1; i <= n; ++i) {
        if (!q.empty() && i != 1) {
            if (r[i] > q.front().fr) {
                ans--;
                q.pop();
            }
        }
        q.push(mp(r[i], i));
    }
    cout << ans << "\n";
    return 0;
}
